/*
 * @Author: your name
 * @Date: 2024-11-11 14:41:02
 * @LastEditTime: 2024-11-11 14:43:55
 * @LastEditors: your name
 * @Description: In User Settings Edit
 * @FilePath: \.leetcode\704.二分查找.cpp
 */
/*

 * @lc app=leetcode.cn id=704 lang=cpp
 *
 * [704] 二分查找
 */

// @lc code=start
class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size()-1;
        while(left <= right){
            int mid = left + (right - left)/2;
            if(nums[mid] > target){
                right = mid -1;
            }else if(nums[mid] < target){
                left = mid +1;
            }else{
                return mid;
            }
        }
        return -1;
    }
};
// @lc code=end

